Ultrahomogeneous Semilinear Spaces
نویسنده
چکیده
A semilinear space S is a non-empty set of elements called points, provided with a collection of subsets called lines such that any pair of points is contained in at most one line and every line contains at least two points. Two points p and q are said to be collinear if p 6 q and if the pair f p; qg is contained in a line; the line containing two collinear points p and q will be denoted by pq. The degree of a point p is the cardinal number of the set of lines through p, the neighbourhood of p is the set of all points of S which are collinear with p, and a neighbour of p is an element of its neighbourhood. The collinearity graph of a semilinear space S is the graph whose vertices are the points of S and in which two vertices are adjacent if and only if the corresponding points in S are collinear; S is said to be connected if its collinearity graph is connected. The connected components of S are the connected components of its collinearity graph. Semilinear spaces are a common generalization of graphs (when all lines have exactly two points) and of linear spaces (when any pair of points is contained in exactly one line). A semilinear space which is neither a graph nor a linear space will be called proper. If S 0 is a non-empty subset of S, the semilinear structure induced on S 0 is the semilinear space whose points are those of S 0 and whose lines are the intersections of S 0 with all the lines of S having at least two points in S 0. Given a positive integer d , a semilinear space S is said to be d-homogeneous if, whenever the semilinear structures induced on two subsets S1 and S2 of S of cardinality at most d are isomorphic, there is at least one automorphism of S mapping S1 onto S2; if every isomorphism from S1 to S2 can be extended to an automorphism of S, we shall say that S is d-ultrahomogeneous. A semilinear space S is called homogeneous if S is d-homogeneous for every positive integer d , and is ultrahomogeneous if S is d-ultrahomogeneous for every d. The notions of homogeneity and ultrahomogeneity can be de®ned more generally in any class of relational structures (see Cameron [3]). Historically, these notions arise from the Helmholtz±Lie principle of `free mobility of rigid bodies' (1880), a property common to the motion groups of Euclidean and nonEuclidean spaces: in such spaces, every (®nite) set of points can be carried by motion onto any congruent one (see Freudenthal [10] for more details). Georg Cantor [4] pointed out in 1895 that the ordered set of rational numbers Q; < is ultrahomogeneous.
منابع مشابه
Some weak indivisibility results in ultrahomogeneous metric spaces
We study the validity of a partition property known as weak indi-visibility for the integer and the rational Urysohn metric spaces. We also compare weak indivisiblity to another partition property, called age-indivisibility, and provide an example of a countable ultrahomogeneous metric space which is age-indivisible but not weakly indivisible.
متن کاملOptimal Feedback Control of Fractional Semilinear Integro-differential Equations in The Banach Spaces
Recently, there has been significant development in the existence of mild solutions for fractional semilinear integro-differential equations but optimal control is not provided. The aim of this paper is studying optimal feedback control for fractional semilinear integro-differential equations in an arbitrary Banach space associated with operators ...
متن کاملC-Homogeneous Graphs Via Ordered Pencils
Let C be a class of graphs closed under isomorphism and let ~ C be obtained from C by arc anchorage. A concept of ~ C-homogeneous graphs that include the C-ultrahomogeneous graphs is given, with the explicit construction of ~ C-homogeneous graphs that are not C-ultrahomogeneous, via ordered pencils of binary projective spaces.
متن کاملConstructing {K2s, Tts,t}K2-Homogeneous Graphs with Pencils
Let C be a class of graphs. A restricted concept of C-homogeneous graphs generalizing the C-ultrahomogeneous graphs of [5] is given. Subsequently, a construction of non-line-graphical {K2s, Tts,t}K2 homogeneous graphs that includes the {K4, K2,2,2}K2 -ultrahomogeneous graph of [2], by means of ordered pencils of binary projective spaces, is shown to yield 20 such graphs that are not {K2s, Tts,t...
متن کاملA classification of finite homogeneous semilinear spaces
A semilinear space S is homogeneous if, whenever the semilinear structures induced on two finite subsets S1 and S2 of S are isomorphic, there is at least one automorphism of S mapping S1 onto S2. We give a complete classification of all finite homogeneous semilinear spaces. Our theorem extends a result of Ronse on graphs and a result of Devillers and Doyen
متن کامل